Improved progressive edge-growth algorithm for fast encodable LDPC codes
نویسندگان
چکیده
منابع مشابه
Improved progressive edge-growth algorithm for fast encodable LDPC codes
The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....
متن کاملDesign of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth
Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length co...
متن کاملTurbo Equalization With Optimized Linearly Encodable LDPC Codes
Turbo equalization is a joint iterative equalization and decoding technique known to produce superior performance for Inter-Symbol Interference (ISI) channel, comparing to noniterative methods. We analyze turbo equalization that employs linearly encodable LDPC codes. The codes are irregular and their degree profiles are optimized in order to achieve capacityapproaching performance. To optimize ...
متن کاملMulti-Edge Type LDPC Codes
We introduce multi-edge type LDPC codes, a generalization of the concept of irregular LDPC codes that yields improvements in performance, range of applications, adaptability and error floor. The multiedge type LDPC codes formalism includes various constructions that have been proposed in the literature including, among others, concatenated tree (CT) codes [1], (generalized irregular) repeat acc...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2012
ISSN: 1687-1499
DOI: 10.1186/1687-1499-2012-178